On weighted sublinear separators

نویسندگان

چکیده

Consider a graph G with an assignment of costs to vertices. Even if and all its subgraphs admit balanced separators sublinear size, may only separator cost after deleting small set Z exceptional We improve the bound on ∣ from O ( log V ) … , for any fixed number iterations logarithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sublinear separators, fragility and subexponential expansion

Let G be a subgraph-closed graph class with bounded maximum degree. We show that if G has balanced separators whose size is smaller than linear by a polynomial factor, then G has subexponential expansion. This gives a partial converse to a result of Nešetřil and Ossona de Mendez. As an intermediate step, the proof uses a new kind of graph decompositions. The concept of graph classes with bounde...

متن کامل

On classes of graphs with strongly sublinear separators

For real numbers c, ε > 0, let Gc,ε denote the class of graphs G such that each subgraph H of G has a balanced separator of order at most c|V (H)|1−ε. A class G of graphs has strongly sublinear separators if G ⊆ Gc,ε for some c, ε > 0. We investigate properties of such graph classes, leading in particular to an approximate algorithm to determine membership in Gc,ε: there exist c > 0 such that f...

متن کامل

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

15 صفحه اول

Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem

Given d > 2 and a set of n grid points Q in <, we design a randomized algorithm that finds a w-wide separator, which is determined by a hyper-plane, in O(n 2 d log n) sublinear time such that Q has at most ( d d+1 + o(1))n points one either side of the hyper-plane, and at most cdwn d−1 d points within w 2 distance to the hyper-plane, where cd is a constant for fixed d. In particular, c3 = 1.209...

متن کامل

Weighted Anisotropic Product Hardy Spaces and Boundedness of Sublinear Operators

Let A1 and A2 be expansive dilations, respectively, on R n and R. Let ~ A ≡ (A1, A2) and Ap( ~ A) be the class of product Muckenhoupt weights on R × R for p ∈ (1, ∞]. When p ∈ (1, ∞) and w ∈ Ap( ~ A), the authors characterize the weighted Lebesgue space L w (R × R) via the anisotropic Lusin-area function associated with ~ A. When p ∈ (0, 1], w ∈ A∞( ~ A), the authors introduce the weighted anis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Theory

سال: 2021

ISSN: ['0364-9024', '1097-0118']

DOI: https://doi.org/10.1002/jgt.22777